BOOLE: A Boundary Evaluation System for Boolean Combinations of Sculptured Solids
نویسندگان
چکیده
In this paper we describe a system, BOOLE, that generates the boundary representations (B-reps) of solids given as a CSG expression in the form of trimmed B ezier patches. The systemmakes use of techniques from computational geometry, numerical linear algebra and symbolic computation to generate the B-reps. Given two solids, the system rst computes the intersection curve between the two solids using our surface intersection algorithm. Using the topological information of each solid, it computes various components within each solid generated by the intersection curve and their connectivity. The component classi cation step is performed by ray-shooting. Depending on the Boolean operation performed, appropriate components are put together to obtain the nal solid. We also present techniques to parallelize this system on shared memory multiprocessor machines. The system has been successfully used to generate B-reps for a number of large industrial models including parts of a notional submarine storage and handling room (courtesy Electric Boat Inc.) and Bradley ghting vehicle (courtesy Army Research Labs). Each of these models is composed of over 8000 Boolean operations and is represented using over 50,000 trimmed B ezier patches. Our exact representation of the intersection curve and use of stable numerical algorithms facilitate an accurate boundary evaluation at every Boolean set operation and generation of topologically consistent solids.
منابع مشابه
BOOLE A System to Compute Boolean Combinations of Sculptured Solids
We present a system to compute Boolean combinations of sculptured solids The surface of each solid is represented as a collection of trimmed and untrimmed spline surfaces and a connectivity graph Based on algorithms for trapezoidation of polygons partitioning of polygons using polygonal chains surface intersection of high degree spline surfaces and ray shooting we compute the boundaries of the ...
متن کاملInteractive Boundary Computation of Boolean Combinations of Sculptured Solids
We present algorithms and systems for interactive boundary computation of Boolean combinations of sculptured solids. The algorithm is applicable to all spline solids and computes an accurate boundary representation.To speed up the computation, the algorithm exploits parallelism at all stages. It has been implemented on a multi-processor SGI and takes one second on average per boolean operation ...
متن کامل2 Boundary Computation of Csg Models with Nurbs Primitives
We present eecient and accurate algorithms for Boolean combinations of solids composed of sculptured models. The boundary of each solid is represented as a collection of trimmed spline surfaces and a connectivity graph. Based on algorithms for trapezoidation of polygons , partitioning of polygons using polygonal chains, surface intersection of high degree spline surfaces and ray-shooting, the b...
متن کاملRepresentation, Boundary Computation and Fast Display of CSG Models with NURBS Primitives
We present e cient and accurate algorithms for Boolean combinations of solids composed of sculptured models. The boundary of each solid is represented as a collection of trimmed spline surfaces and a connectivity graph. Based on algorithms for trapezoidation of polygons, partitioning of polygons using polygonal chains, surface intersection of high degree spline surfaces and ray-shooting, the bo...
متن کاملEecient B-rep Generation of Low Degree Sculptured Solids Using Exact Arithmetic
We present e cient representations and algorithms for exact boundary computation on low degree sculptured CSG solids using exact arithmetic Most of the previous work using exact arithmetic has been restricted to polyhedral models In this paper we generalize it to higher order objects whose boundaries are composed of rational parametric surfaces The use of exact arithmetic and representation gua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Geometry Appl.
دوره 11 شماره
صفحات -
تاریخ انتشار 2001